Solving Square Jigsaw Puzzles Using Dynamic Programming and the Hungarian Procedure
نویسندگان
چکیده
منابع مشابه
Solving Square Jigsaw Puzzles Using Dynamic Programming and the Hungarian Procedure
Problem statement: To design, implement, and test an algorithm for solving the square jigsaw puzzle problem, which has many applications in image processing, pattern recognition, and computer vision such as restoration of archeological artifacts and image descrambling. Approach: The algorithm used the gray level profiles of border pixels for local matching of the puzzle pieces, which was perfor...
متن کاملSolving Square Jigsaw Puzzles with Loop Constraints
We present a novel algorithm based on “loop constraints” for assembling non-overlapping square-piece jigsaw puzzles where the rotation and the position of each piece are unknown. Our algorithm finds small loops of puzzle pieces which form consistent cycles. These small loops are in turn aggregated into higher order “loops of loops” in a bottom-up fashion. In contrast to previous puzzle solvers ...
متن کاملSolving Jigsaw Puzzles with Linear Programming
We propose a novel Linear Program (LP) based formulation for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the standard NP-hard formulation, that can describe both jigsaws with pieces of unknown position and puzzles of unknown position and orientation. The main contribution and strength of our approach comes from the LP assembly strategy...
متن کاملAn Improved Heuristic-based Approach for Solving Square Jigsaw Puzzles
An algorithm for assembling square jigsaw puzzles is presented. We commence by introducing criteria that govern the selection of proper jigsaw puzzle solving method for a given application. Our algorithm uses the gray level profiles of border pixels for local matching of the puzzle pieces. Unlike the classical best-first search, the algorithm simultaneously locates the neighbors of a puzzle pie...
متن کاملSolving Jigsaw Puzzles using Paths and Cycles
There has been a growing interest in image jigsaw puzzles with square shaped pieces. A solver takes as input square shaped patches of the same size belonging to an image and attempts to reconstruct the image. The key components of a jigsaw solver are a compatibility metric and an assembly algorithm. A compatibility metric uses the color content of the image patches to identify which pairs of pi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Applied Sciences
سال: 2009
ISSN: 1546-9239
DOI: 10.3844/ajassp.2009.1941.1947